Complete bipartite graph - PDFSEARCH.IO - Document Search Engine

Complete bipartite graph
Results: 71

#	Item
21	XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks Roger Wattenhofer and Aaron Zollinger {wattenhofer, zollinger}@inf.ethz.ch Department of Computer Science, ETH Zurich 8092 Zurich, Switzerland Add to Reading List Source URL: disco.ethz.ch Language: English Graph theory Mathematics NP-complete problems Spanning tree Edsger W. Dijkstra Routing algorithms Search algorithms Topology control Unit disk graph Connectivity Minimum spanning tree Bipartite graph
22	Sheep: A Scalable Distributed Graph Partitioner Daniel Margo Margo Seltzer Algorithm Problem Add to Reading List Source URL: acmsocc.github.io Language: English - Date: 2016-02-21 03:10:50 Graph theory NP-complete problems Bipartite graphs Graph Tree Graph coloring Pathwidth Modular decomposition
23	On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich Add to Reading List Source URL: www.cs.rpi.edu Language: English - Date: 2011-07-18 11:44:43 Combinatorial optimization Graph theory NP-complete problems Network theory Edsger W. Dijkstra Steiner tree problem Simplex Matching Bipartite graph Graph Shortest path problem A* search algorithm
24	Recovering Social Networks by Observing Votes Benjamin Fish and Yi Huang and Lev Reyzin Department of Mathematics, Statistics, & Computer Science University of Illinois at Chicago, Chicago, IL 60607 {bfish3,yihuang89,lre Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2015-12-18 15:57:04 Graph theory Bipartite graph Parity Graph Ear decomposition Matching NP-complete problems Graph coloring Line graph
25	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-09 09:55:11 Graph theory Graph coloring Matching NP-complete problems Combinatorial optimization Graph operations Blossom algorithm Bipartite graph Chordal graph Complete coloring Cograph Ear decomposition
26	Fixed-Parameter Tractability of Token Jumping on Planar Graphs arXiv:1406.6567v2 [cs.DM] 11 MarTakehiro Ito1 , Marcin Kami´ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-11 21:08:35 Graph theory NP-complete problems Planar graphs Independent set Graph Matching Ear decomposition Clique Bipartite graph Line graph Chordal graph
27	DRAFT On Paths in a Complete Bipartite Geometric Graph Atsushi Kaneko1 and M.Kano2 1 Add to Reading List Source URL: gorogoro.cis.ibaraki.ac.jp Language: English - Date: 2006-01-08 02:49:22
28	Graph Matching with Anchor Nodes: A Learning Approach Nan Hu Raif M. Rustamov Leonidas Guibas Stanford University Add to Reading List Source URL: geometry.stanford.edu Language: English - Date: 2013-07-22 03:52:47 Combinatorial optimization Graph theory Matching Graph Hypergraph Graph operations NP-complete problems Bipartite double cover Line graph
29	The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of set Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2013-05-11 13:53:39 Graph theory Mathematics Graph coloring Combinatorial optimization Matching NP-complete problems Bipartite graph Union-closed sets conjecture Maximal independent set Triangle-free graph
30	Local Properties of Geometric Graphs Jean Cardinal∗ S´ebastien Collette† Stefan Langerman‡ § relation between any pair of sites and the number of items in its neighborhood. Add to Reading List Source URL: www.ulb.ac.be Language: English - Date: 2011-02-08 09:21:41 Graph theory Bipartite graphs Geometric spanner Shortest path problem Planar graph Tree Delaunay triangulation NP-complete problems Planar separator theorem Trapezoid graph

UPDATE